ECPDR: An Efficient Conditional Privacy-Preservation Scheme with Demand Response for Secure Ad hoc Social Communications

The recent rise and widespread adoption of wireless networked embedded systems for mobile communication applications has sparked numerous visions of an ever more networked and interactive world. One such vision proposed in the past years are wireless ad hoc social networks, where wireless ad hoc communication and mobile devices are combined with integrated social characteristics to exchange data related games, rumors, and interesting information. However, they are still faces many challenges including routing security and privacy preservation. In this paper, the authors propose an Efficient Conditional Privacy preservation scheme with Demand Response, called ECPDR, for implement an effective information security, and achieving privacy preservation of message transmitted over wireless ad hoc social networks. They choose Ad hoc On demand Distance Vector (AODV) as a reactive routing protocol. This routing protocol has been extended to include the necessary parameters to perform the cryptographic operations at the nodes. Based on the cooperative neighbor and the short signatures technique, the proposed ECPDR scheme can not only detect and avoid but also can preserves the message privacy against elemental attacks and compound attacks. Extensive analyses and experiments are given to demonstrate its high detection rate and practicability under various scenarios. ECPDR: An Efficient Conditional PrivacyPreservation Scheme with Demand Response for Secure Ad hoc Social Communications